syntactically complete system

syntactically complete system
синтаксически полная система

English-Russian scientific dictionary. 2008.

Игры ⚽ Поможем сделать НИР

Смотреть что такое "syntactically complete system" в других словарях:

  • Type system — Type systems Type safety Inferred vs. Manifest Dynamic vs. Static Strong vs. Weak Nominal vs. Structural Dependent typing Duck typing Latent typing Linear typing Uniqueness typing …   Wikipedia

  • Completeness — In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields. Contents 1 Logical completeness 2 Mathematical completeness 3 Computing 4 …   Wikipedia

  • completeness — See completely. * * * Concept of the adequacy of a formal system that is employed both in proof theory and in model theory (see logic). In proof theory, a formal system is said to be syntactically complete if and only if every closed sentence in… …   Universalium

  • Negationstreu — (engl.: negation complete) ist eine Eigenschaft von Folgen Φ von prädikatenlogischen Ausdrücken. Diese Eigenschaft wird in Verwechslungsgefahr zu andersgemeinten Begriffen der Vollständigkeit auch syntaktisch vollständig (in der… …   Deutsch Wikipedia

  • HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… …   Encyclopedia of Judaism

  • Programming language — lists Alphabetical Categorical Chronological Generational A programming language is an artificial language designed to communicate instructions to a machine, particularly a computer. Programming languages can be used to create programs that… …   Wikipedia

  • Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… …   Wikipedia

  • Theory (mathematical logic) — This article is about theories in a formal language, as studied in mathematical logic. For other uses, see Theory (disambiguation). In mathematical logic, a theory (also called a formal theory) is a set of sentences in a formal language. Usually… …   Wikipedia

  • linguistics — /ling gwis tiks/, n. (used with a sing. v.) the science of language, including phonetics, phonology, morphology, syntax, semantics, pragmatics, and historical linguistics. [1850 55; see LINGUISTIC, ICS] * * * Study of the nature and structure of… …   Universalium

  • Hindley–Milner — In type theory, Hindley–Milner (HM) (also known as Damas–Milner or Damas–Hindley–Milner) is a classical type inference method with parametric polymorphism for the lambda calculus, first described by J. Roger Hindley[1] and later rediscovered by… …   Wikipedia

  • PROSODY, HEBREW — This article is a survey of the history of Hebrew poetic forms from the Bible to the present time. The entry is arranged according to the following outline: introduction the variety of formal systems the specific nature of hebrew literary history …   Encyclopedia of Judaism


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»